Combinatorics of bicubic maps with hard particles

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

M ay 2 00 5 Combinatorics of bicubic maps with hard particles

We present a purely combinatorial solution of the problem of enumerating pla-nar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class o...

متن کامل

Ja n 20 05 Combinatorics of bicubic maps with hard particles

We present a purely combinatorial solution of the problem of enumerating pla-nar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class o...

متن کامل

Combinatorics of Hard Particles on Planar Graphs

We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in this purely combinatorial language.

متن کامل

Combinatorics of distance doubling maps ∗

We study the combinatorics of distance doubling maps on the circle R/Z with prototypes h(β) = 2β mod 1 and h(β) = −2β mod 1, representing the orientation preserving and orientation reversing case, respectively. In particular, we identify parts of the circle where iterates f◦n of a distance doubling map f provide ‘distance doubling behavior’. The results include well-known statements for h relat...

متن کامل

Combinatorics of Cremona monomial maps

One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of monomials defining the inverse can be obtained explicitly in terms of the initial data. A neat consequence is drawn for the plane Cremona monomial group, in particu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and General

سال: 2005

ISSN: 0305-4470,1361-6447

DOI: 10.1088/0305-4470/38/21/002